/**
    MVP Tree data structure using graph database for I/O storage
    Copyright (C) 2014  David G. Starkweather

    This program is free software: you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.

    David Starkweather starkd88@gmail.com
**/

package org.phash.mvptree;

/**
 * class to hold stat info
 **/
public class MVPStats {

    public int height;       /* height of mvp tree structure */
    public int nbleafs;      /* no. leaf nodes */
    public int nbinternals;  /* no. internal nodes */
    public int nbdatapoints; /* total no. of data points (not including vantage points) */
    public int nbvps;        /* total no. of vantage points in tree */
    public int nblevels;     /* no. levels including intermediate indexing levels within nodes */

    public void MVPStats(){
	this.height = 0;
	this.nbleafs = 0;
	this.nbinternals = 0;
	this.nbdatapoints = 0;
	this.nbvps = 0;
	this.nblevels = 0;
    }
}